Algebra of communicating processes with abstraction
نویسندگان
چکیده
منابع مشابه
The Algebra of Communicating Processes With Empty Process
The axiom systems BPX, BPAE,, PA " and ACP " which are in essence the systems BPA, PA and ACP extended with the empty process are presented. For the system ACP " , that contains the other three systems, the first steps are taken towards making it operational: the most basic supplementary axioms are given. It is also adapted such that they can deal with the empty process and a graph model is con...
متن کاملA Model of Behaviour Abstraction for Communicating Processes
In this paper we investigate the notion that a system is an acceptable implementation of another base or target system, in the case that the two systems have diierent interfaces. For instance, the base processes can be thought of as speciica-tions, or ideal processes operating in an error-free environment, while the implementations model their actual realisation possibly employing a variety of ...
متن کاملStrong Fairness and Full Abstraction for Communicating Processes
We construct several denotational semantics for communicating processes that incorporate assumptions of strong (process) fairness. Strong fairness is the guarantee that every process enabled infinitely often will make progress infinitely often. Modeling fairness compositionally requires care: generally speaking, the fair computations of a command cannot be defined only in terms of the fair comp...
متن کاملTraces, Pomsets, Fairness and Full Abstraction for Communicating Processes
We provide a denotational trace semantics for processes with synchronous communication and a form of weakly fair parallelism. The semantics is fully abstract: processes have the same trace sets if and only if their communication behaviors are identical in all contexts. The model can easily be adapted for asynchronously communicating processes, or for shared-memory parallel programs. We also pro...
متن کاملReactive Programming using the Algebra of Communicating Processes
R&D on reactive programming is growing and this has delivered quite many language constructs, libraries and tools. Scala programmers can use threads, timers, actors, futures, promises, observables, the async construct, and others. Still it seems to us that the state of the art is not mature: reactive programming is relatively hard, and confidence in correct operation depends mainly on extensive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1985
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90088-x